منابع مشابه
An involution on bicubic maps and β(0, 1)-trees
Bicubic maps are in bijection with β(0, 1)-trees. We introduce two new ways of decomposing β(0, 1)-trees. Using this we define an endofunction on β(0, 1)-trees, and thus also on bicubic maps. We show that this endofunction is in fact an involution. As a consequence we are able to prove some surprising results regarding the joint equidistribution of certain pairs of statistics on trees and maps....
متن کاملFitting Planar Graphs on Planar Maps
Graph and cartographic visualization have the common objective to provide intuitive understanding of some underlying data. We consider a problem that combines aspects of both by studying the problem of fitting planar graphs on planar maps. After providing an NP-hardness result for the general decision problem, we identify sufficient conditions so that a fit is possible on a map with rectangular...
متن کاملGray coding planar maps
The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, we utilize β-description trees to cyclicly Gray code three classes of cubic planar maps, namely, bicubic planar maps, 3-connected cubic planar maps, and cubic non-separable planar maps.
متن کاملNew extremal binary self-dual codes of lengths 64 and 66 from bicubic planar graphs
Abstract. In this work, connected cubic planar bipartite graphs and related binary self-dual codes are studied. Binary self-dual codes of length 16 are obtained by face-vertex incidence matrices of these graphs. By considering their lifts to the ring R2 new extremal binary self-dual codes of lengths 64 are constructed as Gray images. More precisely, we construct 15 new codes of length 64. Moreo...
متن کاملCounting unrooted loopless planar maps
We present a formula for the number of n-edge unrooted loopless planar maps considered up to orientation-preserving isomorphism. The only sum contained in this formula is over the divisors of n. Résumé. Nous présentons une formule pour le nombre de cartes planaires sans boucles avec n arêtes, à isomorphisme près préservant l’orientation. La seule somme contenue dans cette formule est prise parm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’institut Fourier
سال: 1999
ISSN: 0373-0956
DOI: 10.5802/aif.1708